Fast algorithms for decomposable graphs
نویسنده
چکیده
A celebrated theorem by Courcelle states that every problem definable in monadic second-order logic (MSO) can be solved in linear time on graphs of bounded treewidth. This meta-theorem along with its extensions by Arnborg, Lagergren, and Seese as well as by Courcelle and Mosbah explains, why many important graph problems that are NP-hard on general graphs can be solved efficiently on tree-decomposable graphs. Such problems include, for instance, Vertex Cover, Dominating Set, 3-Colorability, Steiner Tree, MaxCut, and Hamiltonian Cycle. The standard proof of Courcelle’s Theorem is to translate the MSO-formula into a finite-state tree automaton that accepts a tree decomposition of the input graph iff the graph is a model for the MSO-formula. Existing, optimized software such as MONA can be used to construct the corresponding tree automaton, which for bounded treewidth is of constant size. Unfortunately, the constants involved can become extremely large – every quantifier alternation in the MSO formula requires a power set construction for the automaton. Here, the required space causes severe problems in practical applications. In this thesis, we develop a novel approach based on model checking games, also known as Hintikka games. We show that one can construct the model checking game via a linear-time dynamic programming algorithm on a tree decomposition of the input graph. To make the size of the games manageable in practical settings, we introduce a three-valued extension of the classical model checking game and a technique that we call “early determinization.” Furthermore, we describe our implementation of the resulting MSO model checking algorithm for graphs of bounded treewidth and present experimental results. These indicate that for some natural optimization problems our approach is a suitable alternative to Integer Linear Optimization.
منابع مشابه
Mixed cycle-E-super magic decomposition of complete bipartite graphs
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ΣνεV(H) f(v) + ΣeεE(H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥ ...
متن کاملConstructing vertex decomposable graphs
Recently, some techniques such as adding whiskers and attaching graphs to vertices of a given graph, have been proposed for constructing a new vertex decomposable graph. In this paper, we present a new method for constructing vertex decomposable graphs. Then we use this construction to generalize the result due to Cook and Nagel.
متن کاملMixed cycle-E-super magic decomposition of complete bipartite graphs
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ∑νεV (H) f(v) + ∑νεE (H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥...
متن کاملVertex Decomposable Simplicial Complexes Associated to Path Graphs
Introduction Vertex decomposability of a simplicial complex is a combinatorial topological concept which is related to the algebraic properties of the Stanley-Reisner ring of the simplicial complex. This notion was first defined by Provan and Billera in 1980 for k-decomposable pure complexes which is known as vertex decomposable when . Later Bjorner and Wachs extended this concept to non-pure ...
متن کاملComplement of Special Chordal Graphs and Vertex Decomposability
In this paper, we introduce a subclass of chordal graphs which contains $d$-trees and show that their complement are vertex decomposable and so is shellable and sequentially Cohen-Macaulay.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013